Graph Drawing for Floorplanning with Flexible Blocks
نویسندگان
چکیده
We discuss further development of a modified force-directed graph drawing placement algorithm for reducing wire length while placing flexible blocks during the floorplanning stage of computer chip design. An effective repelling perimeter allows floorplanning blocks and to pass through each other during early stages of a run in response to spring tensions on the edges, yet repel just enough to avoid overlap in later stages. Pressure equalization equations permit flexible blocks to reshape dynamically in reaction to penetration from neighboring blocks. We present a number of experimental results demonstrating the feasibility of this approach, achieving up to 31% wirelength improvement over commercial tools.
منابع مشابه
Efficient Algorithms for Drawing Planar Graphs
This thesis presents efficient algorithms for drawing planar graphs. Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. In this thesis we study rectangular drawings, orthogonal drawings, convex drawings and our newly defined box-rectangular drawings. Rectangular drawings and box-rec...
متن کامل52 . 2 Floorplanning with Alignment and Performance Constraints
In this paper, we present a floorplanning algorithm based on sequence pair representation. Our floorplanner has the following important features: 1) It is explicitly designed for fixed-frame floorplanning, which is different from traditional well-researched minarea floorplanning. Moreover, we also show that it can be adapted to minimize total area. 2) It addresses the problem of handling alignm...
متن کاملApplication of Area Predicted TCG Algorithm in Floorplanning with Boundary Constraint
Floorplanning determines the positions of blocks on a chip subject to various objectives. In practical physical design, on the requirement of placing some blocks along the boundaries of the chip such as the blocks can be connected to I/O pads, the floorplanning with boundary constraint is raised. In this paper, we apply a floorplanning algorithm named area predicted transitive closure graphs (A...
متن کاملOctagonal Drawings of Plane Graphs with Prescribed Face Areas
a r t i c l e i n f o a b s t r a c t An orthogonal drawing of a plane graph is called an octagonal drawing if each inner face is drawn as a rectilinear polygon of at most eight (polygonal) vertices and the contour of the outer face is drawn as a rectangle. A slicing graph is obtained from a rectangle by repeatedly slicing it vertically and horizontally. A slicing graph is called a good slicing...
متن کاملPhysical Design for System-On-a-Chip
This chapter is focused on the physical design for system-on-a-chip (SOC). Physical design refers to all synthesis steps that convert a circuit representation (gates, transistors) into a geometric representation (polygons and theirs shapes). See Figure 1 for an illustration. The geometric representation, also called layout , is used to design masks and then manufacture a chip. As a very complic...
متن کامل